KERNELIZATION ALGORITHMS FOR A GENERALIZATION OF THE COMPONENT ORDER CONNECTIVITY PROBLEM

In the component order connectivity problem, we are given a finite undirected graph G = (V,E) and non-negative integers k, ℓ. The goal of this problem is to determine whether there exists subset S ⊆ V such that |S| ≤ k size every connected subgraph induced by \ at most paper, consider generalization where condition on sizes components generalized non-decreasing subadditive functions defined subsets V. We prove kernelization techniques for proposed Xiao can be our setting.